Some universal noiseless multiterminal source coding theorems

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Second-order noiseless source coding theorems

I. Kontoyiannis Appeared in IEEE Trans. Inform. Theory, 43, pp. 1339 1341, July 1997. Abstract { Shannon's celebrated source coding theorem can be viewed as a \one-sided law of large numbers." We formulate second-order noiseless source coding theorems for the deviation of the codeword lengths from the entropy. For a class of sources that includes Markov chains we prove a \one-sided central limi...

متن کامل

A method for proving multiterminal source coding theorems

The optimal coding problem in two-user white Gaussianchannels with feedback is discussed. The messages are taken as Gauss-Markov processes. The optimal decoder pair and the optimal linear encoderpair are developed. A nonlinear class (additive feedback type) of encoderpairs in which the optimal linear encoder pair is optimal is presented.

متن کامل

Universal noiseless coding

A&ruct-Universal coding is any asymptotically opt imum method of block-to-block memoryless source coding for sources with unknown parameters. This paper considers noiseless coding for such sources, primarily in terms of variable-length coding, with performance measured as a function of the coding redundancy relative to the per-letter conditional source entropy given the unknown parameter. It is...

متن کامل

Efficient universal noiseless source codes

Although the existence of universal noiseless variable-rate codes for the class of discrete stationary ergodic sources has previously been established, very few practical universal encoding methods are available. Efficient implementable universal source coding techniques are discussed in this paper. Results are presented on source codes for which a small value of the maximum redundancy is achie...

متن کامل

Noiseless Coding Theorems Corresponding to Fuzzy Entropies

Noiseless coding theorems connected with fuzzy entropies corresponding to Shannon, Renyi and Havrada and Charvat have been established. The upper bounds of these entropies in terms of mean code word lengths have been provided and some interesting properties of these codeword lengths have been studied.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Information and Control

سال: 1980

ISSN: 0019-9958

DOI: 10.1016/s0019-9958(80)90693-2